51![JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek JMLR: Workshop and Conference Proceedings vol 40:1–30, 2015 Computational Lower Bounds for Community Detection on Random Graphs Bruce Hajek](https://www.pdfsearch.io/img/0723ed1244637caec0aa70f27379d8bb.jpg) | Add to Reading ListSource URL: jmlr.orgLanguage: English - Date: 2015-07-20 20:08:36
|
---|
52![Sharp threshold for the appearance of certain spanning trees in random graphs Dan Hefetz ∗ Sharp threshold for the appearance of certain spanning trees in random graphs Dan Hefetz ∗](https://www.pdfsearch.io/img/da47b5dce8801887135394bd5888d296.jpg) | Add to Reading ListSource URL: page.mi.fu-berlin.deLanguage: English - Date: 2013-06-27 08:12:36
|
---|
53![EXTREMAL CUTS OF SPARSE RANDOM GRAPHS AMIR DEMBO∗ , ANDREA MONTANARI† , AND SUBHABRATA SEN Abstract. For Erd˝ os-R´enyi random graphs with average degree γ, and uniformly random γ-regular graph on n vertices,pwe EXTREMAL CUTS OF SPARSE RANDOM GRAPHS AMIR DEMBO∗ , ANDREA MONTANARI† , AND SUBHABRATA SEN Abstract. For Erd˝ os-R´enyi random graphs with average degree γ, and uniformly random γ-regular graph on n vertices,pwe](https://www.pdfsearch.io/img/083b1e362a8db43661d794acdac9ef6c.jpg) | Add to Reading ListSource URL: web.stanford.eduLanguage: English - Date: 2015-04-23 23:09:13
|
---|
54![Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities Adrien Todeschini and Fran¸ cois Caron arXiv:1602.02114v1 [stat.ME] 5 Feb 2016 Exchangeable Random Measures for Sparse and Modular Graphs with Overlapping Communities Adrien Todeschini and Fran¸ cois Caron arXiv:1602.02114v1 [stat.ME] 5 Feb 2016](https://www.pdfsearch.io/img/ce50796838925dff57418f45cfd500d3.jpg) | Add to Reading ListSource URL: arxiv.orgLanguage: English - Date: 2016-02-07 20:23:25
|
---|
55![Generating Unlabeled Connected Cubic Planar Graphs Uniformly at Random* Manuel Bodirsky,1 Clemens Gröpl,2 Mihyun Kang1 1 Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, 10099 Generating Unlabeled Connected Cubic Planar Graphs Uniformly at Random* Manuel Bodirsky,1 Clemens Gröpl,2 Mihyun Kang1 1 Humboldt-Universität zu Berlin, Institut für Informatik, Unter den Linden 6, 10099](https://www.pdfsearch.io/img/378f3512dc7c74fd0513684019fe925a.jpg) | Add to Reading ListSource URL: www.math.tugraz.atLanguage: English - Date: 2015-09-25 05:39:50
|
---|
56![BACK S HIFT : Learning causal cyclic graphs from unknown shift interventions Dominik Rothenh¨ausler⇤ BACK S HIFT : Learning causal cyclic graphs from unknown shift interventions Dominik Rothenh¨ausler⇤](https://www.pdfsearch.io/img/eb6c645850b32dcb2ab3695d350d2243.jpg) | Add to Reading ListSource URL: papers.nips.ccLanguage: English - Date: 2015-12-18 15:54:52
|
---|
57![ON COVERING EXPANDER GRAPHS BY HAMILTON CYCLES ´ ROMAN GLEBOV, MICHAEL KRIVELEVICH, AND TIBOR SZABO Abstract. The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In thi ON COVERING EXPANDER GRAPHS BY HAMILTON CYCLES ´ ROMAN GLEBOV, MICHAEL KRIVELEVICH, AND TIBOR SZABO Abstract. The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In thi](https://www.pdfsearch.io/img/454e2000a9efa05bfeceba4a3a559611.jpg) | Add to Reading ListSource URL: page.mi.fu-berlin.deLanguage: English - Date: 2012-05-03 00:13:41
|
---|
58![Positional games on random graphs Miloˇs Stojakovi´c ∗† Tibor Szab´o∗ Positional games on random graphs Miloˇs Stojakovi´c ∗† Tibor Szab´o∗](https://www.pdfsearch.io/img/efcb1f8e08e780fd936335c52a47c4be.jpg) | Add to Reading ListSource URL: page.mi.fu-berlin.deLanguage: English - Date: 2008-09-03 14:36:11
|
---|
59![Preferential Attachment in Graphs with Affinities Jay-Yoon Lee* Manzil Zaheer* Stephan G¨ Preferential Attachment in Graphs with Affinities Jay-Yoon Lee* Manzil Zaheer* Stephan G¨](https://www.pdfsearch.io/img/fab28fcc72cbf3309c76378bed3ba7c7.jpg) | Add to Reading ListSource URL: manzil.mlLanguage: English - Date: 2016-01-03 02:26:34
|
---|
60![Mihyun Kang Institute of Optimization and Discrete Mathematics, Graz University of Technology Random Graphs: From Nature to Society to the Brain The theory of random graphs deals with
Mihyun Kang Institute of Optimization and Discrete Mathematics, Graz University of Technology Random Graphs: From Nature to Society to the Brain The theory of random graphs deals with](https://www.pdfsearch.io/img/c5b3cf0a7aabd63340fc5bc9b2c1974a.jpg) | Add to Reading ListSource URL: www.math.tugraz.atLanguage: English - Date: 2015-01-20 02:26:25
|
---|